Recursion of Logical Operators and Regeneration of Discrete Binary Space

Any discrete (closed) binary, or Boolean, space is recursive. That is, if the outputs of functions are repeatedly forward-fed into those functions, those outputs will present themselves again for processing. That is, the full functionality of an operator reproduces itself. Each of the 16 operators, or functions, in a two variable system is a selfmaintaining (homeostatic) automaton in logical space. The homeostatic character of the function is displayed by that recursion. As larger binary spaces are comprised of the functions (partial or complete), functional recursion may open the way to analysing basins of attraction in spaces produced by the random concatenation of operators to reveal the character of pattern generation. Further, recursion of binary logical operators may have correlates in biological neural networks.